Hamiltonian index is NP-complete
نویسندگان
چکیده
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is Research supported by grants No. 1M0545 and MSM 4977751301 of the Czech Ministry of Education. Supported by Nature Science Funds of China under Contract Grant No.: 10671014
منابع مشابه
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs
The Hamiltonian cycle problem is to decide whether a given graph has a Hamiltonian cycle. Bertossi and Bonuccelli (1986, Information Processing Letters, 23, 195200) proved that the Hamiltonian Cycle Problem is NP-Complete even for undirected path graphs and left the Hamiltonian cycle problem open for directed path graphs. Narasimhan (1989, Information Processing Letters, 32, 167-170) proved tha...
متن کاملHamiltonian Path in Split Graphs- a Dichotomy
In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs in the context of Hamiltonian path problem, and as a consequence, we obtain a polynomial-time algorithm to the Hamiltonian path problem in $K_{1,4}$-free spl...
متن کاملTwo conjectures such that the proof of any one of them will lead to the proof that P = NP
In this paper we define a construct called a time-graph. A complete time-graph of order n is the cartesian product of a complete graph with n vertices and a linear graph with n vertices. A time-graph of order n is given by a subset of the set of edges E(n) of such a graph. The notion of a hamiltonian time-graph is defined in a natural way and we define the Hamiltonian time-graph problem (HAMTG)...
متن کاملCs 598csc: Approximation Algorithms 1 the Traveling Salesperson Problem (tsp) 1.1 Tsp in Undirected Graphs
In the Traveling Salesperson Problem, we are given an undirected graph G = (V,E) and cost c(e) > 0 for each edge e ∈ E. Our goal is to find a Hamiltonian cycle with minimum cost. A cycle is said to be Hamiltonian if it visits every vertex in V exactly once. TSP is known to be NP-complete, and so we cannot expect to exactly solve TSP in polynomial time. What is worse, there is no good approximat...
متن کاملThe parity Hamiltonian cycle problem
This paper investigates a variant of the Hamiltonian Cycle (HC) problem, named the Parity Hamiltonian Cycle (PHC ) problem: The problem is to find a closed walk visiting each vertex odd number of times, instead of exactly once. We show that the PHC problem is in P even when a closed walk is allowed to use an edge at most z = 4 times, by considering a T -join, which is a generalization of matchi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 159 شماره
صفحات -
تاریخ انتشار 2011